A parallel approach to bi-objective integer programming
نویسندگان
چکیده
منابع مشابه
A parallel approach to bi-objective integer programming
To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and present these as the solution to a BOIP problem. Historically, these algorithms have been compared in terms of the number of single-objective IPs solved and total CPU time taken to produce the solution to a problem. ...
متن کاملA two-stage approach for bi-objective integer linear programming
We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...
متن کاملA Robust Programming Approach to Bi-objective Optimization Model in the Disaster Relief Logistics Response Phase
Accidents and natural disasters and crises coming out of them indicate the importance of an integrated planning to reduce their effected. Therefore, disaster relief logistics is one of the main activities in disaster management. In this paper, we study the response phase of the disaster management cycle and a bi-objective model has been developed for relief chain logistic in uncertainty conditi...
متن کاملAn Integer Linear Programming approach to the single and bi-objective Next Release Problem
Context: The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. Objective: In this ...
متن کاملBranch-and-bound for bi-objective integer programming
In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2017
ISSN: 1445-8810
DOI: 10.21914/anziamj.v58i0.11724